A Linear Logic Treatment of Phrase Structure

نویسنده

  • Joshua S. Hodas
چکیده

A number of researchers have proposed applications of Girard’s Linear Logic [7] to computational linguistics. Most have focused primarily on the connection between linear logic and categorial grammars. In this work we show how linear logic can be used to provide an attractive encoding of phrase structure grammars for parsing structures involving unbounded dependencies. The resulting grammars are closely related to Generalized Phrase Structure Grammars [4, 5]. As part of the presentation we show how a variety of issues, such as island and coordination constraints can be dealt with in this model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Next or Beyond Next: Effect of Contrastive Phrase-Based Treatment on Stage Gain Across Self-Paced and More Time-Constrained Tasks

This study explored the effect of contrastive phrase resynthesis instruction ongaining the teachability hypothesis stages in self-paced versus time-constrained oralproduction and recognition. Three groups (i.e., 23 learners) of high beginner femalelearners in an English language institute were randomly selected from a cohort oflearners. One group received contrastive metalinguistic instruction ...

متن کامل

تولید درخت بانک سازه‌ای زبان فارسی به روش تبدیل خودکار

Treebanks is one of important and useful resource in Natural Language Processing tasks. Dependency and phrase structures are two famous kinds of treebanks. There have already made many efforts to convert dependency structure to phrase structure. In this paper we study an approach to convert dependency structure to phrase structure because of lack of a big phrase structure Treebank in Persian. A...

متن کامل

Specifying Filler-Gap Dependency Parsers in a Linear-Logic Programming Language

An aspect of the Generalized Phrase Structure Grammar formalism proposed by Gazdar, et al. is the introduction of the notion of "slashed categories" to handle the parsing of structures, such as relative clauses, which involve unbounded dependencies. This has been implemented in Definite Clause Grammars through the technique of gap threading, in which a difference list of extracted noun phrases ...

متن کامل

Genic Interaction Extraction with Semantic and Syntactic Chains

This paper describes the system that we submitted to the “Learning Language in Logic” Challenge of extracting directed genic interactions from sentences in Medline abstracts. The system uses Markov Logic, a framework that combines log-linear models and First Order Logic, to create a set of weighted clauses which can classify pairs of gene named entities as genic interactions. These clauses are ...

متن کامل

ارائۀ راهکاری قاعده‌مند جهت تبدیل خودکار درخت تجزیۀ نحوی وابستگی به درخت تجزیۀ نحوی ساخت‌سازه‌ای برای زبان فارسی

In this paper, an automatic method in converting a dependency parse tree into an equivalent phrase structure one, is introduced for the Persian language. In first step, a rule-based algorithm was designed. Then, Persian specific dependency-to-phrase structure conversion rules merged to the algorithm. Subsequently, the Persian dependency treebank with about 30,000 sentences was used as an input ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997